Non-deterministic exponential time has two-prover interactive protocols

Errata for On the Power of Multi-Prover Interactive Protocols

On the power of multi-prover interactive protocols

Fortnow, L., J. Rompel, M. Sipser, On the power of multi-prover interactive protocols, Theoretical Computer Science 134 (1994) 545-557. We look at complexity issues of interactive proof systems with multiple provers separated from each other. This model, developed by Ben-Or et al. (1988) allows the verifier to play the provers off each other. We show this model equivalent to an alternative inte...

Daniel Apon 1 From IP = PSPACE to NP = PCP ( log , 1 ) : NEXP has multi - prover interactive protocols

If you’ve read the notes on the history of the PCP theorem referenced in Lecture 19 [3], you will already be familiar with the excitement that surrounded discoveries such as IP=PSPACE and NP=PCP(log, 1). Taken alone, however, these two theorems might seem at most cursorily related to one another. The earlier discovery of IP=PSPACE deals with a much stronger class, assuming the polynomial hierar...

Entanglement-Resistant Two-Prover Interactive Proof Systems and Non-Adaptive Private Information Retrieval Systems

We show that, for any language in NP, there is an entanglement-resistant constant-bit two-prover interactive proof system with a constant completeness vs. soundness gap. The previously proposed classical two-prover constant-bit interactive proof systems are known not to be entanglement-resistant. This is currently the strongest expressive power of any known constant-bit answer multi-prover inte...

Non-Malleable Multi-Prover Interactive Proofs and Witness Signatures

We explore a new man-in-the-middle adversarial model for multi-prover interactive proofs (MIPs), and construct round-optimal, unconditionally secure, non-malleable MIPs. We compile from a large sub-class of Σ-protocols to a non-malleable MIP, avoiding the use of expensive NP-reductions to Graph Hamiltonicity or other NP-complete problems. Our compiler makes novel use of non-malleable codes – in...